Pseudo random bit generator
نویسنده
چکیده
0110011010101010101010010101
منابع مشابه
An Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...
متن کاملNew Design of Crypto-Based Pseudo random number generator (CBPRNG) using BLOW FISH cipher
Random Number Generators (RNGs) are an important building block for algorithms and protocols in cryptography. Random number generation is used in a wide variety of cryptographic operations, such as key generation and challenge/response protocols. A random number generator outputs a sequence of 0s and 1s such that at any position, the next bit cannot be expected on the previous bits. However, tr...
متن کاملAn Improved Pseudo-random Generator Based on Discrete Log
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pseudo-random bit generator. This new generator outputs n− c− 1 bits per exponentiation with a c-bit exponent. Using typical parameters, n = 1024 and c = 160, this yields roughly 860 pseudo-random bits per small exponent...
متن کاملImprovement and Analysis of a Pseudo Random Bit Generator by Means of Cellular Automata
In this paper, we implement a revised pseudo random bit generator based on a rule-90 cellular automaton. For this purpose, we introduce a sequence matrix HN with the aim of calculating the pseudo random sequences of N bits employing the algorithm related to the automaton backward evolution. In addition, a multifractal structure of the matrix HN is revealed and quantified according to the multif...
متن کاملA Fast Chaos-Based Pseudo-Random Bit Generator Using Binary64 Floating-Point Arithmetic
Chaos-based cryptography is widely investigated in recent years, especially in the field of random number generators. The paper describes a novel pseudo-random bit generator (PRBG) based on chaotic logistic maps. Three logistic maps are combined in the algorithmic process, and a block of 32 random bits is produced at each iteration. The binary64 double precision format is used according to the ...
متن کاملA Pseudo-Random Bit Generator Using Three Chaotic Logistic Maps
A novel pseudo-random bit generator (PRBG) using three chaotic logistic maps is proposed. The algorithm generates at each iteration sequences of 32 bit-blocks by starting from randomly chosen initial seeds. The impact of relying on IEEE 754-2008 floating-point representation format for the generator is also taken into account. The performance of the generator is evaluated through various statis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007